The cutoff phenomenon for ergodic Markov processes

نویسندگان

  • Guan-Yu Chen
  • Laurent Saloff-Coste
چکیده

We consider the cutoff phenomenon in the context of families of ergodic Markov transition functions. This includes classical examples such as families of ergodic finite Markov chains and Brownian motion on families of compact Riemannian manifolds. We give criteria for the existence of a cutoff when convergence is measured in L-norm, 1 < p < ∞. This allows us to prove the existence of a cutoff in cases where the cutoff time is not explicitly known. In the reversible case, for 1 < p ≤ ∞, we show that a necessary and sufficient condition for the existence of a max-L cutoff is that the product of the spectral gap by the max-L mixing time tends to infinity. This type of condition was suggested by Yuval Peres. Illustrative examples are discussed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cutoff Phenomenon for Random Walks on Kneser Graphs

The cutoff phenomenon for an ergodic Markov chain describes a sharp transition in the convergence to its stationary distribution, over a negligible period of time, known as cutoff window. We study the cutoff phenomenon for simple random walks on Kneser graphs, which is a family of ergodic Markov chains. Given two integers n and k, the Kneser graph K(2n+ k, n) is defined as the graph with vertex...

متن کامل

Explicit expanders with cutoff phenomena

The cutoff phenomenon describes a sharp transition in the convergence of an ergodic finite Markov chain to equilibrium. Of particular interest is understanding this convergence for the simple random walk on a bounded-degree expander graph. The first example of a family of bounded-degree graphs where the random walk exhibits cutoff in total-variation was provided only very recently, when the aut...

متن کامل

The L2-cutoff for reversible Markov processes

We consider the problem of proving the existence of an L2-cutoff for families of ergodic Markov processes started from given initial distributions and associated with reversible (more, generally, normal) Markov semigroups. This includes classical examples such as families of finite reversible Markov chains and Brownian motion on compact Riemannian manifolds. We give conditions that are equivale...

متن کامل

Separation and coupling cutoffs for tuples of inde - pendent Markov processes Stephen

We consider an n-tuple of independent ergodic Markov processes, each of which converges (in the sense of separation distance) at an exponential rate, and obtain a necessary and sufficient condition for the n-tuple to exhibit a separation cutoff. We also provide general bounds on the (asymmetric) window size of the cutoff, and indicate links to classical extreme value theory.

متن کامل

Cutoff for non-backtracking random walks on sparse random graphs

Reduced `-cohomology in degree 1 (for short "LpR1") is a useful quasiisometry invariant of graphs [of bounded valency] whose definition is relatively simple. On a graph, there is a natural gradient operator from functions to vertices to functions on edges defined by looking at the difference of the value on the extremities of the edge. Simply put, this cohomology is the quotient of functions wi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008